Turning SOS Rules into Equations

نویسندگان

  • Luca Aceto
  • Bard Bloom
  • Frits W. Vaandrager
چکیده

Many process algebras are deened by structural operational semantics (SOS). Indeed , most such deenitions are nicely structured and t the GSOS format of 15]. We give a procedure for converting any GSOS language deenition to a nite complete equa-tional axiom system (possibly with one innnitary induction principle) which precisely characterizes strong bisimulation of processes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dogfooding the Structural Operational Semantics of mCRL2

The mCRL2 language is a formal specification language that is used to specify and model the behavior of distributed systems and protocols. With the accompanying toolset, it is possible to simulate, visualize, analyze and verify behavioral properties of mCRL2 models automatically. The semantics of the mCRL2 language is defined formally using Structural Operational Semantics (SOS) but implemented...

متن کامل

Semantics and expressiveness of ordered SOS

Structured Operational Semantics (SOS) is a popular method for defining semantics by means of transition rules. An important feature of SOS rules is negative premises, which are crucial in the definitions of such phenomena as priority mechanisms and time-outs. However, the inclusion of negative premises in SOS rules also introduces doubts as to the preferred meaning of SOS specifications. Order...

متن کامل

Generating priority rewrite systems for OSOS process languages

We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisimulation and head normalising. The algorithm is inspired by a procedure which was developed by Aceto, Bloom and Vaandrager and presented in Turning SOS rules into equations [2]. For a subclass of OSOS process languages ...

متن کامل

A Pi-Calculus with Explicit Substitutions: the Late Semantics

A new formulation of the-calculus, where name instantiation is handled explicitly, is presented. The explicit handling of name instantiation allows us to reduce the-calculus transitional semantics to a standard SOS framework. Hence,-calculus bisimulation models can take fully advantage of the SOS meta-theory developed for`static' process calculi. For instance, complete axiomatic characterizatio...

متن کامل

The Meaning of Ordered SOS

Structured Operational Semantics (SOS) is a popular method for defining semantics by means of deduction rules. An important feature of deduction rules, or simply SOS rules, are negative premises, which are crucial in the definitions of such phenomena as priority mechanisms and time-outs. Orderings on SOS rules were proposed by Phillips and Ulidowski as an alternative to negative premises. The m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Comput.

دوره 111  شماره 

صفحات  -

تاریخ انتشار 1992